The complexity of signed graph and edge-coloured graph homomorphisms
نویسندگان
چکیده
منابع مشابه
The complexity of signed graph and edge-coloured graph homomorphisms
The goal of this work is to study homomorphism problems (from a computational point of view) on two superclasses of graphs: 2-edge-coloured graphs and signed graphs. On the one hand, we consider the H-Colouring problem when H is a 2-edge-coloured graph, and we show that a dichotomy theorem would imply the dichotomy conjecture of Feder and Vardi. On the other hand, we prove a dichotomy theorem f...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملThe complexity of counting graph homomorphisms
The problem of counting homomorphisms from a general graph G to a fixed graph H is a natural generalisation of graph colouring, with important applications in statistical physics. The problem of deciding whether any homomorphism exists was considered by Hell and Nešetřil. They showed that decision is NPcomplete unless H has a loop or is bipartite; otherwise it is in P. We consider the problem o...
متن کاملCorrigendum: The complexity of counting graph homomorphisms
We close a gap in the proof of Theorem 4.1 in our paper “The complexity of counting graph homomorphisms” [Random Structures and Algorithms 17 (2000), 260– 289]. Our paper [2] analysed the complexity of counting graph homomorphisms from a given graph G into a fixed graph H. This problem was called #H. A crucial step in our argument, Theorem 4.1, was to prove that the counting problem #H is #P -c...
متن کاملThe complexity of tropical graph homomorphisms
A tropical graph (H, c) consists of a graph H and a (not necessarily proper) vertex-colouring c of H. For a fixed tropical graph (H, c), the decision problem (H, c)-Colouring asks whether a given input tropical graph (G, c1) admits a homomorphism to (H, c), that is, a standard graph homomorphism of G to H that also preserves vertex-colours. We initiate the study of the computational complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.08.005